منابع مشابه
An Asynchronous Parallel Differential Evolution Algorithm
A Parallel Differential Evolution algorithm is presented in this work, developed for a cluster of computers in Windows environment. The parallelization is realized using an asynchronous approach, utilizing a Master-Slave architecture. A separate executable program is used to evolve each member of the population. The current population is stored in a folder accessible by all executables; each cu...
متن کاملParallel Genetic Algorithm Using Algorithmic Skeleton
Algorithmic skeleton has received attention as an efficient method of parallel programming in recent years. Using the method, the programmer can implement parallel programs easily. In this study, a set of efficient algorithmic skeletons is introduced for use in implementing parallel genetic algorithm (PGA).A performance modelis derived for each skeleton that makes the comparison of skeletons po...
متن کاملParallel Genetic Algorithm Using Algorithmic Skeleton
Algorithmic skeleton has received attention as an efficient method of parallel programming in recent years. Using the method, the programmer can implement parallel programs easily. In this study, a set of efficient algorithmic skeletons is introduced for use in implementing parallel genetic algorithm (PGA).A performance modelis derived for each skeleton that makes the comparison of skeletons po...
متن کاملPerturbation-Iteration Algorithm for Solving Heat and Mass Transfer in the Unsteady Squeezing Flow between Parallel Plates
In this paper, heat and mass transfer in the unsteady squeezing flow between parallel plates is analyzed using a perturbation-iteration algorithm. The similarity transformation is used to transform the governing partial differential equations into ordinary differential equations, before being solved. The solutions of the velocity, temperature and concentration are derived and sketched to explai...
متن کاملEvolution in Time and Space-The Parallel Genetic Algorithm
The parallel genetic algorithm (PGA) uses two major modiications compared to the genetic algorithm. Firstly, selection for mating is distributed. Individuals live i n a 2-D w orld. Selection of a mate is done by each i n d i-vidual independently in its neighborhood. Secondly, e a c h individual may improve its tness during its lifetime by e.g. local hill-climbing. The PGA is totally asynchronou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Soft Computing
سال: 2019
ISSN: 1568-4946
DOI: 10.1016/j.asoc.2018.11.044